Gradient-Based Optimization for Bayesian Preference Elicitation
نویسندگان
چکیده
منابع مشابه
Design Preference Elicitation Using Efficient Global Optimization
We seek to elicit individual design preferences through usercomputer interaction. During an iteration of the interactive session, the computer presents a set of designs to the user who then picks any preferred designs from the set. The computer learns from this feedback and creates the next set of designs using its accumulated knowledge to minimize a merit function. Under the hypothesis that us...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملPreference elicitation for interactive learning of Optimization Modulo Theory problems
We consider the problem of automatically discovering the solution preferred by a decision maker (DM). Recent work in the field of constraint programming [8] formalizes the user preferences in terms of soft constraints, whose weights are assumed to be partially unknown. An elicitation strategy is introduced based on the DM queries for constraint weights. In this paper, soft constraints are cast ...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملPreference Elicitation for DCOPs
Distributed Constraint Optimization Problems (DCOPs) offer a powerful approach for the description and resolution of cooperative multi-agent problems. In this model, a group of agents coordinate their actions to optimize a global objective function, taking into account their preferences or constraints. A core limitation of this model is the assumption that the preferences of all agents or the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2020
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v34i06.6592